Iterative Learning Identi

نویسندگان

  • Yangquan Chen
  • Changyun Wen
  • Huifang Dou
  • Mingxuan Sun
چکیده

An iterative learning identiication method is proposed for curve identiication problems. The basic idea is to convert the curve identiication problem into an optimal tracking control problem. The measured trajectories are regarded as the desired trajectories to be optimally tracked and the curve to be identiied is taken as a virtual control function. A high-order learning updating law is applied. A convergence condition is obtained in a general problem setting. Two case studies, which are related to the aerodynamic drag coeecient curve extraction from actual ight testing data, are presented to show the practical usefulness of the proposed method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative learning identification and control for dynamic systems described by NARMAX model

A new iterative learning controller is proposed for a general unknown discrete time-varying nonlinear non-affine system represented by NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model. The proposed controller is composed of an iterative learning neural identifier and an iterative learning controller. Iterative learning control and iterative learning identification ar...

متن کامل

Rened Incremental Learning

The paper provides a systematic study of incremental learning algorithms. The general scenario is as follows. Let c be any concept; then every in nite sequence of elements exhausting c is called positive presentation of c. An algorithmic learner takes as input one element of a positive presentation and its previously made hypothesis at a time, and outputs a new hypothesis about the target conce...

متن کامل

Modeling Incremental Learning from Positive Data

The present paper deals with a systematic study of incremental learning algorithms. The general scenario is as follows. Let c be any concept; then every in nite sequence of elements exhausting c is called positive presentation of c. An algorithmic learner successively takes as input one element of a positive presentation as well as its previously made hypothesis at a time, and outputs a new hyp...

متن کامل

Learning Concepts Incrementally With Bounded Data Mining

Important re nements of incremental concept learning from positive data considerably restricting the accessibility of input data are studied. Let c be any concept; every in nite sequence of elements exhausting c is called positive presentation of c. In all learning models considered the learning machine computes a sequence of hypotheses about the target concept from a positive presentation of i...

متن کامل

Identi cation of normalized coprime plant factors from closed loop

Recently introduced methods of iterative identi cation and control design are directed towards the design of high performing and robust control systems. These methods show the necessity of identifying approximate models from closed loop plant experiments. In this paper a method is proposed to approximately identify normalized coprime plant factors from closed loop data. The fact that normalized...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007